for _ in range(int(input())):
n, m = map(int, input().split())
print(*sorted(max(x + y, n - 1 - x + y, x + m - 1 - y, n - 1 - x + m - 1 - y) for x in range(n) for y in range(m)))
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n, m, k;
cin >> n >> m;
vector<int> v;
for (int i = 0; i < n; ++i)
for (int j = 0; j < m; ++j)
v.push_back(max(i, n - i - 1) + max(j, m - j - 1));
sort(v.begin(), v.end());
for (int i = 0; i < n * m; ++i)
cout << v[i] << " ";
cout << "\n";
}
int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int t;
cin >> t;
while(t--) solve();
return 0;
}1051. Height Checker | 695. Max Area of Island |
402. Remove K Digits | 97. Interleaving String |
543. Diameter of Binary Tree | 124. Binary Tree Maximum Path Sum |
1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts | 501A - Contest |
160A- Twins | 752. Open the Lock |
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |